Nearly convex segmentation of polyhedra through convex ridge separation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nearly convex segmentation of polyhedra through convex ridge separation

Decomposing a 3D model into approximately convex components has gained more attention recently due to its ability to efficiently generate small decomposition with controllable concavity bound. However, current methods are computationally expensive and require many user parameters. These parameters are usually unintuitive and add unnecessary obstacles in processing a large number of meshes and m...

متن کامل

Polyhedra Fabrication through Mesh Convexification: a Study of Foldability of Nearly Convex Shapes

A polyhedron can be unfolded to a net, i.e., an unfolding without overlapping, by carefully cutting along the surface. If the cuts are restricted only on the edges of the polyhedron, where should the cuts be? This is called an edge-unfolding problem, which has been extensively studied in the literature for centuries. Although several promising properties have been discovered, several recent pre...

متن کامل

Refold rigidity of convex polyhedra

We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, we identify several polyhedra that are “edge-unfold rigid” in the sense that each of their unfoldings may only fold back to the original. For example, each of the 43,380 edge unfoldings of a dodecahedron...

متن کامل

Affine Unfoldings of Convex Polyhedra

We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Dürer’s unfoldability problem, which answers a question of Croft, Falconer, and Guy. Among other techniques, the proof employs a topological characterization for embeddings among the planar immersions of the disk.

متن کامل

Spiral Unfoldings of Convex Polyhedra

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic polyhedra, overlap is more the rule than the exception. The structure of spiral unfoldings is investigated, primarily by analyzing one particular class, the poly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer-Aided Design

سال: 2016

ISSN: 0010-4485

DOI: 10.1016/j.cad.2016.05.015